Traffic Grooming in Bidirectional WDM Ring

نویسندگان

  • Jean-Claude Bermond
  • David Coudert
  • Xavier Muñoz
  • Ignasi Sau
چکیده

We study the minimization of ADMs (Add-Drop Multiplexers) in Optical WDM Networks with Bidirectional Ring topology considering symmetric shortest path routing and all-to-all unitary requests. We insist on the statement of the problem, which had not been clearly stated before in the bidirectional case. Optimal solutions had not been found up to date. In particular, we study the case C = 2 and C = 3 (giving either optimal constructions or near-optimal solutions) and the case C = k(k+1)/2 (giving optimal decompositions for specific congruence classes of N). We state a general Lower Bound for all the values of C and N, and we improve this Lower Bound for C=2 and C=3 (when N=4t+3). We also include some comments about the simulation of the problem using Linear Programming.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Effective traffic grooming in WDM rings

Much work has focused on traffic grooming in WDM ring networks. Previous work has considered many aspects of traffic grooming, including minimizing number of ADMs, minimizing number of wavelengths, single hub and multiple hub architectures, switching capabilities etc. In this work, we derive general and tighter bounds on the number of wavelengths in WDM ring networks that may be capable of swit...

متن کامل

Traffic Grooming in Bidirectional

6 We study the minimization of ADMs (Add-Drop Multiplexers) in optical WDM bidirectional 7 rings considering symmetric shortest path routing and all-to-all unitary requests. We precisely for8 mulate the problem in terms of graph decompositions, and state a general lower bound for all the 9 values of the grooming factor C and N, the size of the ring. We first study exhaustively the cases 10 C = ...

متن کامل

Dynamic traffic grooming algorithms for reconfigurable SONET over WDM networks - Global Telecommunications Conference, 2002. GLOBECOM '02. IEEE

Most of today's optical networks are built on E:ONET rings [I]. Using WDM technology, multiple rings can be sup ported on a single fiber ring [3]. In this architecture, each wavelength independently carries a SONET ring. Each SONET ring can further support multiple low speed streams (e.g. an OC48 SONET ring can support 4 OC-12 or 16 OC-3 streams at the same time). At each node a WDM Add/Drop Mu...

متن کامل

Traffic grooming in an optical WDM mesh network

In wavelength-division multiplexing (WDM) optical networks, the bandwidth request of a traffic stream can be much lower than the capacity of a lightpath. Efficiently grooming low-speed connections onto high-capacity lightpaths will improve the network throughput and reduce the network cost. In WDM/SONET ring networks, it has been shown in the optical network literature that by carefully groomin...

متن کامل

Interconnected WDM Ring Networks: Strategies for Interconnection and Traffic Grooming*

In telecommunication networks, SONET self -healing rings are widely deployed as transport infrastructure. Typically, multiple rings are interconnected together to provide a large geographical coverage. A typical network-planning problem of traffic grooming deals with packing several TDM sub-channels into high-speed wavelength channels in a WDM ring with the goal of saving SONET equipment usage....

متن کامل

Inter - Semester 2011 Handout 13 1 5 Traffic Grooming inWavelength - RoutedWDMNet

In the last chapter, we assume that each source-destination (s-d) pair has its taffic demand equal to an integer multiple of wavelength unit. Accordingly, supporting such traffic in transparent wavelength division multiplexing (WDM) networks can be done by establishing lightpaths between s-d pairs. In addition, these established lightpaths will be fully utilized. In this chapter, we allow for s...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2006